A Krull–Remak–Schmidt theorem for fusion systems
نویسندگان
چکیده
We prove that the factorization of a saturated fusion system over discrete $p$-toral group as product indecomposable subsystems is unique up to normal automorphisms and permutations factors. In particular, if
منابع مشابه
channel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولSome generalizations of Darbo's theorem for solving a systems of functional-integral equations via measure of noncompactness
In this paper, using the concept of measure of noncompactness, which is a very useful and powerful tools in nonlinear functional analysis, metric fixed point theory and integral equations, we introduce a new contraction on a Banach space. For this purpose by using of a measure of noncompactness on a finite product space, we obtain some generalizations of Darbo’s fixed-point theorem. Then, with ...
متن کاملVector ultrametric spaces and a fixed point theorem for correspondences
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
متن کاملA Decomposition Theorem for Probabilistic Transition Systems
In this paper we prove that every nite Markov chain can be de composed into a cascade product of a Bernoulli process and several simple permutation reset deterministic automata The original chain is a state homomorphic image of the product By doing so we give a positive answer to an open question stated in Paz concerning the decomposability of probabilistic systems Our result is based on the ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2022
ISSN: ['0016-2736', '1730-6329']
DOI: https://doi.org/10.4064/fm160-5-2022